Test Surmise Relations, Test Knowledge Structures, and Their Characterizations
نویسندگان
چکیده
This paper investigates natural, left-, right-, and total-covering test surmise relations on a set of tests partitioning the domain of a knowledge structure. The properties of reflexivity, transitivity, and antisymmetry are examined. In particular, it is shown that the property of antisymmetry is satisfied for the left-, right-, and total-covering test surmise relations when the underlying knowledge structure is discriminative and the domain is finite. This paper also investigates natural, l-, r-, and c-type test knowledge structures. The concepts of a test surmise relation and test knowledge structure respectively generalize the concepts of a surmise relation and knowledge structure in knowledge space theory. The main thrust of this paper is an examination of characterizations of these models. Unlike at the level of items, at the level of tests, the test surmise relations and test knowledge structures may not necessarily be (uniquely) derived from each other. (a) Each can be characterized by the underlying surmise relation and knowledge structure, (b) the test surmise Preprint submitted to Journal of Mathematical Psychology 16 August 2007 relations can be characterized by the test knowledge structures, and (c) the test knowledge structures can, at least under some condition, be characterized by the test surmise relations.
منابع مشابه
Surmise Relations Between Tests - Mathematical Considerations
In 1985, Doignon and Falmagne introduced surmise relations for representing prerequisite relationships between items within a body of information for the assessment of knowledge. Often it is useful to partition such a body of information into sub-collections. As we are primarily interested in psychological applications, we refer to these sub-collections as tests. We extend the concept of surmis...
متن کاملKnowledge Spaces for Inductive Reasoning Tests
Die Wissensraumtheorie (Doignon & Falmagne, 1985;1999), in der Testitems durch sog. Vermutungsrelationen geordnet werden, wurde verallgemeinert, um Vermutungsrelationen zwischen Tests zu definieren (Albert, 1995, Brandt, Albert & Hockemeyer, 1999;accepted). Als erste exemplarische Anwendung dieses Modells werden verschiedene Typen von induktiven Denkaufgaben nach dem Prinzip der komponentenweis...
متن کاملAn Empirical Test of a Process Model for Letter Series Completion Problems
The connection between the theory of knowledge spaces and formal models of cognitive problem solving processes is examined. This connection is described for a model of the cognitive processes of subjects in solving letter series completion problems, which is based on ideas from Simon and Kotovsky (1963). The model is formulated as an algorithm, depending on its ability to solve letter series co...
متن کاملKnowledge Space Theory
This document explains algorithms and basic operations of knowledge structures and knowledge spaces available in R through the kst package. Knowledge Space Theory (Doignon and Falmagne, 1999) is a set-theoretical framework, which proposes mathematical formalisms to operationalize knowledge structures in a particular domain. The most basic assumption of knowledge space theory is that every knowl...
متن کاملThe Correlational Agreement Coefficient CA(≤, D) - a mathematical analysis of a descriptive goodness-of-fit measure
The Correlational Agreement Coefficient, CA(V,D), was introduced by J.F.J. van Leeuwe in 1974 within Item Tree Analysis (ITA), a data-analytic method to derive quasi orders (surmise relations) on sets of bi-valued test items. Recently, it has become of interest in connection with Knowledge Space Theory (KST). The coefficient CA(V,D) is used as a descriptive goodness-offit measure to select out ...
متن کامل